Ordinal complexity of recursive definitions
نویسندگان
چکیده
منابع مشابه
Ordinal recursive complexity of Unordered Data Nets
Data Nets are a version of colored Petri nets in which tokens carry data taken from an infinite, linearly ordered and dense domain. This class is interesting because, even though very expressive, their coverability/termination problems remain decidable. Those problemas have recently been proven complete for the class Fωωω in the fast growing complexity hierarchy. In this paper we characterize t...
متن کاملThe Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet.
متن کاملCharacterizing Complexity Classes By Higher Type Primitive Recursive Definitions
Higher type primitive recursive definitions (also known as G~del's system T) defining first-order functions (i.e. functions of type ind---~...~ind--~ind, ind for individuals, higher types occur in between) can be classified into an infinite syntactic hierarchy: A definition is in the n'th stage of this hierarchy, a so called rank-n-definition, iff n is an upper bound on the levels of the types ...
متن کاملPositive Inductive-Recursive Definitions
A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) → Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer and Setzer’s theory of inductive-recursive definitions within which C had to be discrete — our work can therefore be seen as lifting this restriction. This is a...
متن کاملRecursive Definitions of Monadic Functions
Alexander Krauss Technische Universität München, Institut für Informatik http://www.in.tum.de/~krauss Abstract Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL’s imperative programming extension, which results i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1992
ISSN: 0890-5401
DOI: 10.1016/0890-5401(92)90027-d